An Efficient Mine Ventilation Solution Method Based on Minimum Independent Closed Loops
نویسندگان
چکیده
منابع مشابه
An approximate solution method based on tabu search for k-minimum spanning tree problems
This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a local optimal solution of k-minimum spanning tree problems. This article provides a new tabu-searchbased approximate solution method that does n...
متن کاملAn efficient optimal solution method for the joint replenishment problem with minimum order quantities
We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic cycle time and propose an efficient global optimisation procedure to solve the JRP with constraints. Mor...
متن کاملETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior of frequent patterns in a transaction database. To discover transitional patterns and their significant milestones, first we have to extract all frequent patterns and their supports using any frequent pattern generation...
متن کاملE-msNFIS: An Efficient Method for Mining Negative Frequent Itemsets based on Multiple Minimum Supports
Negative Frequent Item Sets (NFIS) like (a1a2¬a3a4) have played important roles in real applications because many valued negative association rules can be found from them. Very few methods are available for mining NFIS and most of them only use single minimum support, which implicitly assumes that all items in the database are of the same nature or of similar frequencies in the database. This i...
متن کاملAn efficient solution method for Weber problems with barriers based on genetic algorithms
In this paper we consider the problem of locating one new facility with respect to a given set of existing facilities in the plane and in the presence of convex polyhedral barriers. It is assumed that a barrier is a region where neither facility location nor travelling are permitted. The resulting nonconvex optimization problem can be reduced to a finite series of convex subproblems, which can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2020
ISSN: 1996-1073
DOI: 10.3390/en13225862